Runtime Support of Speculative Optimization for Offline Escape Analysis
نویسندگان
چکیده
Escape analysis can improve the speed and memory efficiency of garbage collected languages by allocating objects to the call stack, but an offline analysis will potentially interfere with dynamic class loading and an online analysis must sacrifice precision for speed. We describe a technique that permits the safe use of aggressive, speculative offline escape analysis in programs potentially loading classes that violate the analysis results.
منابع مشابه
Towards Dynamic Interprocedural Analysis in JVMs
This paper presents a new, inexpensive, mechanism for constructing a complete call graph for Java programs at runtime, and provides an example of using the mechanism for implementing a dynamic reachability-based interprocedural analysis (IPA), namely dynamic XTA. Reachability-based IPAs, such as points-to analysis and escape analysis, require a context-insensitive call graph of the analyzed pro...
متن کاملUSENIX Association
This paper presents a new, inexpensive, mechanism for constructing a complete call graph for Java programs at runtime, and provides an example of using the mechanism for implementing a dynamic reachability-based interprocedural analysis (IPA), namely dynamic XTA. Reachability-based IPAs, such as points-to analysis and escape analysis, require a context-insensitive call graph of the analyzed pro...
متن کاملOptimization of Meshless Local Petrov-Galerkin Parameters using Genetic Algorithm for 3D Elasto-static Problems (TECHNICAL NOTE)
A truly Meshless Local Petrov-Galerkin (MLPG) method is developed for solving 3D elasto-static problems. Using the general MLPG concept, this method is derived through the local weak forms of the equilibrium equations, by using a test function, namely, the Heaviside step function. The Moving Least Squares (MLS) are chosen to construct the shape functions. The penalty approach is used to impose ...
متن کاملImproving Continuation-Powered Method-Level Speculation for JVM Applications
Most applications running on the Java Virtual Machine (JVM) make extensive use of dynamic object-oriented programming features such as inheritance, polymorphism, and encapsulation. This makes them very hard or even impossible to analyze statically, defeating most of the automatic parallelization research done so far for traditional computeheavy scientific applications. In this paper, we propose...
متن کاملSpeculative Parallel & Optimized Execution on Multi-Core Platforms
and Goals: The goal of the proposed research is to enable parallelization and optimization of applications for execution on contemporary multi-core platforms. Via code annotations, the user will provide hints for the presence of parallelism and the usage of static and dynamic data structures. These hints will enable exploitation of potential parallelism in these applications with high levels of...
متن کامل